A natural semantics of first-order type dependency
نویسندگان
چکیده
منابع مشابه
First-Order, Curry-Typed Logic for Natural Language Semantics
The paper presents Property Theory with Curry Typing (PTCT) where the language of terms and well-formed formulæ are joined by a language of types. In addition to supporting fine-grained intensionality, the basic theory is essentially first-order, so that implementations using the theory can apply standard first-order theorem proving techniques. The paper sketches a system of tableau rules that ...
متن کاملA Denotational Semantics for First-Order Logic
In Apt and Bezem [AB99) we provided a computational interpretation of first-order formulas over arbitrary interpretations. Here we complement this work by introducing a denotational semantics for first-order logic. Additionally, by allowing an assignment of a non-ground term to a variable we introduce in this framework logical variables. The semantics combines a number of well-known ideas from ...
متن کاملA Ranking Semantics for First-Order Conditionals
Usually, default rules in the form of conditional statements are built on propositional logic, representing classes of individuals by propositional variables, as in “Birds fly, but penguins don’t”. Only few approaches have addressed the problem of giving formal semantics to first-order conditionals that allow (nonmonotonic) inferences both for classes and for individuals. In this paper, we pres...
متن کاملFirst-Order Stable Model Semantics and First-Order Loop Formulas
Lin and Zhao’s theorem on loop formulas states that in the propositional case the stable model semantics of a logic program can be completely characterized by propositional loop formulas, but this result does not fully carry over to the first-order case. We investigate the precise relationship between the first-order stable model semantics and first-order loop formulas, and study conditions und...
متن کاملSemantics of First Order Parametric Specifications
Parametricity is one of the most effective ways to achieve compositionality and reuse in software development. Parametric specifications have been thoroughly analyzed in the algebraic setting and are by now a standard part of most software development toolkits. However, an effort towards classifying, specifying and refining algorithmic theories, rather than mere datatypes, quickly leads beyond ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1994
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)90067-1